<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT>    package ttpasi.jgenere.chaocipher;<a name="line.1"></a>
<FONT color="green">002</FONT>    <a name="line.2"></a>
<FONT color="green">003</FONT>    import java.util.ArrayList;<a name="line.3"></a>
<FONT color="green">004</FONT>    import java.util.List;<a name="line.4"></a>
<FONT color="green">005</FONT>    <a name="line.5"></a>
<FONT color="green">006</FONT>    public class Cracker<a name="line.6"></a>
<FONT color="green">007</FONT>    {<a name="line.7"></a>
<FONT color="green">008</FONT>      static void insertPermuted(char c, char p, char[] lt, char[] rt)<a name="line.8"></a>
<FONT color="green">009</FONT>      {<a name="line.9"></a>
<FONT color="green">010</FONT>        lt[0] = c;<a name="line.10"></a>
<FONT color="green">011</FONT>        rt[rt.length - 1] = p;<a name="line.11"></a>
<FONT color="green">012</FONT>      }<a name="line.12"></a>
<FONT color="green">013</FONT>    <a name="line.13"></a>
<FONT color="green">014</FONT>      static boolean contains(int[] values, int value)<a name="line.14"></a>
<FONT color="green">015</FONT>      {<a name="line.15"></a>
<FONT color="green">016</FONT>        for (int i = 0; i &lt; values.length; i++)<a name="line.16"></a>
<FONT color="green">017</FONT>        {<a name="line.17"></a>
<FONT color="green">018</FONT>          if (values[i] == value)<a name="line.18"></a>
<FONT color="green">019</FONT>          {<a name="line.19"></a>
<FONT color="green">020</FONT>            return true;<a name="line.20"></a>
<FONT color="green">021</FONT>          }<a name="line.21"></a>
<FONT color="green">022</FONT>        }<a name="line.22"></a>
<FONT color="green">023</FONT>        return false;<a name="line.23"></a>
<FONT color="green">024</FONT>      }<a name="line.24"></a>
<FONT color="green">025</FONT>    <a name="line.25"></a>
<FONT color="green">026</FONT>      static int[] findOpenPositions(char[] lt, char[] rt)<a name="line.26"></a>
<FONT color="green">027</FONT>      {<a name="line.27"></a>
<FONT color="green">028</FONT>        List positions = new ArrayList();<a name="line.28"></a>
<FONT color="green">029</FONT>        for (int i = 0; i &lt; lt.length; i++)<a name="line.29"></a>
<FONT color="green">030</FONT>        {<a name="line.30"></a>
<FONT color="green">031</FONT>          if (lt[i] == '.' &amp;&amp; rt[i] == '.')<a name="line.31"></a>
<FONT color="green">032</FONT>          {<a name="line.32"></a>
<FONT color="green">033</FONT>            positions.add(new Integer(i));<a name="line.33"></a>
<FONT color="green">034</FONT>          }<a name="line.34"></a>
<FONT color="green">035</FONT>        }<a name="line.35"></a>
<FONT color="green">036</FONT>        int[] openPositions = new int[positions.size()];<a name="line.36"></a>
<FONT color="green">037</FONT>        for (int i = 0; i &lt; openPositions.length; i++)<a name="line.37"></a>
<FONT color="green">038</FONT>        {<a name="line.38"></a>
<FONT color="green">039</FONT>          openPositions[i] = ((Integer) positions.get(i)).intValue();<a name="line.39"></a>
<FONT color="green">040</FONT>        }<a name="line.40"></a>
<FONT color="green">041</FONT>        return openPositions;<a name="line.41"></a>
<FONT color="green">042</FONT>      }<a name="line.42"></a>
<FONT color="green">043</FONT>    <a name="line.43"></a>
<FONT color="green">044</FONT>      static void insert(int position, char c, char p, char[] lt, char[] rt)<a name="line.44"></a>
<FONT color="green">045</FONT>      {<a name="line.45"></a>
<FONT color="green">046</FONT>        lt[position] = c;<a name="line.46"></a>
<FONT color="green">047</FONT>        rt[position] = p;<a name="line.47"></a>
<FONT color="green">048</FONT>      }<a name="line.48"></a>
<FONT color="green">049</FONT>    <a name="line.49"></a>
<FONT color="green">050</FONT>      static boolean contains(char[] values, char value)<a name="line.50"></a>
<FONT color="green">051</FONT>      {<a name="line.51"></a>
<FONT color="green">052</FONT>        for (int i = 0; i &lt; values.length; i++)<a name="line.52"></a>
<FONT color="green">053</FONT>        {<a name="line.53"></a>
<FONT color="green">054</FONT>          if (values[i] == value)<a name="line.54"></a>
<FONT color="green">055</FONT>          {<a name="line.55"></a>
<FONT color="green">056</FONT>            return true;<a name="line.56"></a>
<FONT color="green">057</FONT>          }<a name="line.57"></a>
<FONT color="green">058</FONT>        }<a name="line.58"></a>
<FONT color="green">059</FONT>        return false;<a name="line.59"></a>
<FONT color="green">060</FONT>      }<a name="line.60"></a>
<FONT color="green">061</FONT>    <a name="line.61"></a>
<FONT color="green">062</FONT>      static int translate(char[] sourceAlphabet, char[] translatedAlphabet, char sourceChar, char translatedChar)<a name="line.62"></a>
<FONT color="green">063</FONT>      {<a name="line.63"></a>
<FONT color="green">064</FONT>        int position = Utils.position(sourceChar, sourceAlphabet);<a name="line.64"></a>
<FONT color="green">065</FONT>        char oldTranslatedChar = translatedAlphabet[position];<a name="line.65"></a>
<FONT color="green">066</FONT>        if (oldTranslatedChar != '.' &amp;&amp; oldTranslatedChar != translatedChar)<a name="line.66"></a>
<FONT color="green">067</FONT>        {<a name="line.67"></a>
<FONT color="green">068</FONT>          return -1;<a name="line.68"></a>
<FONT color="green">069</FONT>        }<a name="line.69"></a>
<FONT color="green">070</FONT>        translatedAlphabet[position] = translatedChar;<a name="line.70"></a>
<FONT color="green">071</FONT>        return position;<a name="line.71"></a>
<FONT color="green">072</FONT>      }<a name="line.72"></a>
<FONT color="green">073</FONT>    <a name="line.73"></a>
<FONT color="green">074</FONT>      static void findTheAlphabets(int position, char[] ct, char[] pt, String left, String right, int[] holes)<a name="line.74"></a>
<FONT color="green">075</FONT>      {<a name="line.75"></a>
<FONT color="green">076</FONT>        if (position &gt; 24)<a name="line.76"></a>
<FONT color="green">077</FONT>        {<a name="line.77"></a>
<FONT color="green">078</FONT>          System.out.println("&lt;findTheAlphabets&gt;");<a name="line.78"></a>
<FONT color="green">079</FONT>          System.out.println("position: " + position);<a name="line.79"></a>
<FONT color="green">080</FONT>          System.out.println(left);<a name="line.80"></a>
<FONT color="green">081</FONT>          System.out.println(right);<a name="line.81"></a>
<FONT color="green">082</FONT>          //      System.exit(0);<a name="line.82"></a>
<FONT color="green">083</FONT>        }<a name="line.83"></a>
<FONT color="green">084</FONT>    <a name="line.84"></a>
<FONT color="green">085</FONT>        char[] lt = left.toCharArray();<a name="line.85"></a>
<FONT color="green">086</FONT>        char[] rt = right.toCharArray();<a name="line.86"></a>
<FONT color="green">087</FONT>    <a name="line.87"></a>
<FONT color="green">088</FONT>        if (position &gt;= ct.length)<a name="line.88"></a>
<FONT color="green">089</FONT>        {<a name="line.89"></a>
<FONT color="green">090</FONT>          System.out.println("alphabets found");<a name="line.90"></a>
<FONT color="green">091</FONT>          System.exit(0);<a name="line.91"></a>
<FONT color="green">092</FONT>        }<a name="line.92"></a>
<FONT color="green">093</FONT>    <a name="line.93"></a>
<FONT color="green">094</FONT>        if (position == 0)<a name="line.94"></a>
<FONT color="green">095</FONT>        {<a name="line.95"></a>
<FONT color="green">096</FONT>          insertPermuted(ct[position], pt[position], lt, rt);<a name="line.96"></a>
<FONT color="green">097</FONT>          System.out.println("position: " + position);<a name="line.97"></a>
<FONT color="green">098</FONT>          System.out.println(lt);<a name="line.98"></a>
<FONT color="green">099</FONT>          System.out.println(rt);<a name="line.99"></a>
<FONT color="green">100</FONT>          System.out.println("----");<a name="line.100"></a>
<FONT color="green">101</FONT>          findTheAlphabets(position + 1, ct, pt, new String(lt), new String(rt), holes);<a name="line.101"></a>
<FONT color="green">102</FONT>        }<a name="line.102"></a>
<FONT color="green">103</FONT>        else if (contains(holes, position))<a name="line.103"></a>
<FONT color="green">104</FONT>        {<a name="line.104"></a>
<FONT color="green">105</FONT>          //      System.out.println("TRYING HOLE AT " + position);<a name="line.105"></a>
<FONT color="green">106</FONT>          // try to put the letters of the current position into every open paired spaces in alphabets<a name="line.106"></a>
<FONT color="green">107</FONT>          int[] openPositions = findOpenPositions(lt, rt);<a name="line.107"></a>
<FONT color="green">108</FONT>          for (int i = 0; i &lt; openPositions.length; i++)<a name="line.108"></a>
<FONT color="green">109</FONT>          {<a name="line.109"></a>
<FONT color="green">110</FONT>            int pos = openPositions[i];<a name="line.110"></a>
<FONT color="green">111</FONT>            //        System.out.println(position + " - " + pos);<a name="line.111"></a>
<FONT color="green">112</FONT>            char[] ltCopy = new char[lt.length];<a name="line.112"></a>
<FONT color="green">113</FONT>            char[] rtCopy = new char[rt.length];<a name="line.113"></a>
<FONT color="green">114</FONT>            System.arraycopy(lt, 0, ltCopy, 0, lt.length);<a name="line.114"></a>
<FONT color="green">115</FONT>            System.arraycopy(rt, 0, rtCopy, 0, rt.length);<a name="line.115"></a>
<FONT color="green">116</FONT>            insert(pos, ct[position], pt[position], ltCopy, rtCopy);<a name="line.116"></a>
<FONT color="green">117</FONT>            Utils.permuteAlphabets(ltCopy, rtCopy, 0, pos, 13);<a name="line.117"></a>
<FONT color="green">118</FONT>            //        System.out.println(ltCopy);<a name="line.118"></a>
<FONT color="green">119</FONT>            //        System.out.println(rtCopy);<a name="line.119"></a>
<FONT color="green">120</FONT>            //        System.out.println("----");<a name="line.120"></a>
<FONT color="green">121</FONT>            findTheAlphabets(position + 1, ct, pt, new String(ltCopy), new String(rtCopy), holes);<a name="line.121"></a>
<FONT color="green">122</FONT>          }<a name="line.122"></a>
<FONT color="green">123</FONT>          //      System.out.println("FINISHED TRYING HOLE AT " + position);<a name="line.123"></a>
<FONT color="green">124</FONT>        }<a name="line.124"></a>
<FONT color="green">125</FONT>        else<a name="line.125"></a>
<FONT color="green">126</FONT>        {<a name="line.126"></a>
<FONT color="green">127</FONT>          // figure out which direction to translate<a name="line.127"></a>
<FONT color="green">128</FONT>          // translate the correct direction<a name="line.128"></a>
<FONT color="green">129</FONT>          // permute<a name="line.129"></a>
<FONT color="green">130</FONT>          // iterate with position + 1<a name="line.130"></a>
<FONT color="green">131</FONT>    <a name="line.131"></a>
<FONT color="green">132</FONT>          int p;<a name="line.132"></a>
<FONT color="green">133</FONT>          if (contains(rt, pt[position]))<a name="line.133"></a>
<FONT color="green">134</FONT>          {<a name="line.134"></a>
<FONT color="green">135</FONT>            if (contains(lt, ct[position]))<a name="line.135"></a>
<FONT color="green">136</FONT>            {<a name="line.136"></a>
<FONT color="green">137</FONT>              // don't insert the same char again<a name="line.137"></a>
<FONT color="green">138</FONT>              // end this path if the current position doesn't translate correctly<a name="line.138"></a>
<FONT color="green">139</FONT>              int posPt = Utils.position(pt[position], rt);<a name="line.139"></a>
<FONT color="green">140</FONT>              int posCt = Utils.position(ct[position], lt);<a name="line.140"></a>
<FONT color="green">141</FONT>              if (posPt != posCt)<a name="line.141"></a>
<FONT color="green">142</FONT>              {<a name="line.142"></a>
<FONT color="green">143</FONT>                //            System.out.println("translation already exists at different position");<a name="line.143"></a>
<FONT color="green">144</FONT>                //            System.out.println("position: " + position);<a name="line.144"></a>
<FONT color="green">145</FONT>                //            System.out.println("ct[position]: " + ct[position]);<a name="line.145"></a>
<FONT color="green">146</FONT>                //            System.out.println("pt[position]: " + pt[position]);<a name="line.146"></a>
<FONT color="green">147</FONT>                //            System.out.println(lt);<a name="line.147"></a>
<FONT color="green">148</FONT>                //            System.out.println(rt);<a name="line.148"></a>
<FONT color="green">149</FONT>                return;<a name="line.149"></a>
<FONT color="green">150</FONT>              }<a name="line.150"></a>
<FONT color="green">151</FONT>              p = posPt;<a name="line.151"></a>
<FONT color="green">152</FONT>            }<a name="line.152"></a>
<FONT color="green">153</FONT>            else<a name="line.153"></a>
<FONT color="green">154</FONT>            {<a name="line.154"></a>
<FONT color="green">155</FONT>              p = translate(rt, lt, pt[position], ct[position]);<a name="line.155"></a>
<FONT color="green">156</FONT>            }<a name="line.156"></a>
<FONT color="green">157</FONT>          }<a name="line.157"></a>
<FONT color="green">158</FONT>          else if (contains(lt, ct[position]))<a name="line.158"></a>
<FONT color="green">159</FONT>          {<a name="line.159"></a>
<FONT color="green">160</FONT>            p = translate(lt, rt, ct[position], pt[position]);<a name="line.160"></a>
<FONT color="green">161</FONT>          }<a name="line.161"></a>
<FONT color="green">162</FONT>          else<a name="line.162"></a>
<FONT color="green">163</FONT>          {<a name="line.163"></a>
<FONT color="green">164</FONT>            //        System.out.println("failed path");<a name="line.164"></a>
<FONT color="green">165</FONT>            return;<a name="line.165"></a>
<FONT color="green">166</FONT>          }<a name="line.166"></a>
<FONT color="green">167</FONT>          if (p == -1)<a name="line.167"></a>
<FONT color="green">168</FONT>          {<a name="line.168"></a>
<FONT color="green">169</FONT>            //        System.out.println("failed translation");<a name="line.169"></a>
<FONT color="green">170</FONT>            //        System.out.println("position: " + position);<a name="line.170"></a>
<FONT color="green">171</FONT>            //        System.out.println("ct[position]: " + ct[position]);<a name="line.171"></a>
<FONT color="green">172</FONT>            //        System.out.println("pt[position]: " + pt[position]);<a name="line.172"></a>
<FONT color="green">173</FONT>            //        System.out.println(lt);<a name="line.173"></a>
<FONT color="green">174</FONT>            //        System.out.println(rt);<a name="line.174"></a>
<FONT color="green">175</FONT>            return;<a name="line.175"></a>
<FONT color="green">176</FONT>          }<a name="line.176"></a>
<FONT color="green">177</FONT>          Utils.permuteAlphabets(lt, rt, 0, p, 13);<a name="line.177"></a>
<FONT color="green">178</FONT>          //      if (position &gt; 14)<a name="line.178"></a>
<FONT color="green">179</FONT>          //      {<a name="line.179"></a>
<FONT color="green">180</FONT>          //        System.out.println(lt);<a name="line.180"></a>
<FONT color="green">181</FONT>          //        System.out.println(rt);<a name="line.181"></a>
<FONT color="green">182</FONT>          //        System.out.println("----");<a name="line.182"></a>
<FONT color="green">183</FONT>          //      }<a name="line.183"></a>
<FONT color="green">184</FONT>          findTheAlphabets(position + 1, ct, pt, new String(lt), new String(rt), holes);<a name="line.184"></a>
<FONT color="green">185</FONT>        }<a name="line.185"></a>
<FONT color="green">186</FONT>      }<a name="line.186"></a>
<FONT color="green">187</FONT>    <a name="line.187"></a>
<FONT color="green">188</FONT>      //  static void rollBack(char[] left, char[] right, char[] ct, char[] pt, int position)<a name="line.188"></a>
<FONT color="green">189</FONT>      //  {<a name="line.189"></a>
<FONT color="green">190</FONT>      //    if (position &lt;= 0)<a name="line.190"></a>
<FONT color="green">191</FONT>      //    {<a name="line.191"></a>
<FONT color="green">192</FONT>      //      return;<a name="line.192"></a>
<FONT color="green">193</FONT>      //    }<a name="line.193"></a>
<FONT color="green">194</FONT>      //    int zenith = 0;<a name="line.194"></a>
<FONT color="green">195</FONT>      //    int nadir = 13;<a name="line.195"></a>
<FONT color="green">196</FONT>      //    Utils.unrotateMiddle(left, zenith + 1, nadir);<a name="line.196"></a>
<FONT color="green">197</FONT>      //    Utils.unrotateMiddle(right, zenith + 2, nadir);<a name="line.197"></a>
<FONT color="green">198</FONT>      //    int prevPosition = Utils.position(ct[position - 1], left);<a name="line.198"></a>
<FONT color="green">199</FONT>      //    Utils.rotate(left, zenith, prevPosition, left.length);<a name="line.199"></a>
<FONT color="green">200</FONT>      //    Utils.rotate(right, zenith, (prevPosition == 0 ? right.length : prevPosition) - 1, right.length);<a name="line.200"></a>
<FONT color="green">201</FONT>      //    rollBack(left, right, ct, pt, position - 1);<a name="line.201"></a>
<FONT color="green">202</FONT>      //  }<a name="line.202"></a>
<FONT color="green">203</FONT>    <a name="line.203"></a>
<FONT color="green">204</FONT>      //  public static void main(String[] args) throws Exception<a name="line.204"></a>
<FONT color="green">205</FONT>      //  {<a name="line.205"></a>
<FONT color="green">206</FONT>      //    //    findMinSequencesWithHoles(4);<a name="line.206"></a>
<FONT color="green">207</FONT>      //    //    1 sequences found.<a name="line.207"></a>
<FONT color="green">208</FONT>      //    //    ----<a name="line.208"></a>
<FONT color="green">209</FONT>      //    //    length: 261<a name="line.209"></a>
<FONT color="green">210</FONT>      //    //    VCCPHCZQVAWFWIGHMMBTZPTGAIYZVPZDYRHJVJTBPTPJADLWDXOGULWVDGKFGETBBOHDTJVYTDIFHXHVPLUMSZBMAVKUDLORYBWYQVINUMUSCHQQBDXIDWXDPZDWPDCHCBNOATWYDCGOXBUBJVAGGOSQBBGVOCYYPIBAQBLLBBBDCSLZEMSTUWJVWLZROFVMXSLAITGBHPEKSIIEELKULQWRMPXTUUXWAIHACSMFKUGSKFZJWBJZRPZEARIQLGZUUHWJS<a name="line.210"></a>
<FONT color="green">211</FONT>      //    //    ENSHRINEDINTHISARCANUMQTOWHICHNONEWHODOESNOTPOSSESSTHEKEYMAYENTERQTHEDECLARATIONOFINDEPENDENCEANDLINCOLNXSBEAUTIFULORATIONATGETTYSBURGAREHEREREJINFORMEDWITHANINVISIBLEQINTANGIBLEANDIMPERCEPTIBLESOULWJWFWBYRNEQANDMAPHJAGEFRWBEGUNAUGUSTSIXTEENQONENINETHREESEVENWZ<a name="line.211"></a>
<FONT color="green">212</FONT>      //    //    holes at: 1[C,N], 3[P,H], 4[H,R], 11[F,T], <a name="line.212"></a>
<FONT color="green">213</FONT>      //<a name="line.213"></a>
<FONT color="green">214</FONT>      //    //    // find the alphabets<a name="line.214"></a>
<FONT color="green">215</FONT>      //    //    char[] ct = "VCCPHCZQVAWFWIGHMMBTZPTGAIYZVPZDYRHJVJTBPTPJADLWDXOGULWVDGKFGETBBOHDTJVYTDIFHXHVPLUMSZBMAVKUDLORYBWYQVINUMUSCHQQBDXIDWXDPZDWPDCHCBNOATWYDCGOXBUBJVAGGOSQBBGVOCYYPIBAQBLLBBBDCSLZEMSTUWJVWLZROFVMXSLAITGBHPEKSIIEELKULQWRMPXTUUXWAIHACSMFKUGSKFZJWBJZRPZEARIQLGZUUHWJS"        .toCharArray();<a name="line.215"></a>
<FONT color="green">216</FONT>      //    //    char[] pt = "ENSHRINEDINTHISARCANUMQTOWHICHNONEWHODOESNOTPOSSESSTHEKEYMAYENTERQTHEDECLARATIONOFINDEPENDENCEANDLINCOLNXSBEAUTIFULORATIONATGETTYSBURGAREHEREREJINFORMEDWITHANINVISIBLEQINTANGIBLEANDIMPERCEPTIBLESOULWJWFWBYRNEQANDMAPHJAGEFRWBEGUNAUGUSTSIXTEENQONENINETHREESEVENWZ"        .toCharArray();<a name="line.216"></a>
<FONT color="green">217</FONT>      //    //    //           01234567890123456789<a name="line.217"></a>
<FONT color="green">218</FONT>      //    //<a name="line.218"></a>
<FONT color="green">219</FONT>      //    //    String lt = "..........................";<a name="line.219"></a>
<FONT color="green">220</FONT>      //    //    String rt = "..........................";<a name="line.220"></a>
<FONT color="green">221</FONT>      //    //<a name="line.221"></a>
<FONT color="green">222</FONT>      //    //    int[] holes = {1, 3, 4, 11};<a name="line.222"></a>
<FONT color="green">223</FONT>      //    //<a name="line.223"></a>
<FONT color="green">224</FONT>      //    //    initializeLogging();<a name="line.224"></a>
<FONT color="green">225</FONT>      //    //    findTheAlphabets(0, ct, pt, lt, rt, holes);<a name="line.225"></a>
<FONT color="green">226</FONT>      //    char[] left = "SOBFHUJKVQXYRADCEPMWGZLTNI".toCharArray();<a name="line.226"></a>
<FONT color="green">227</FONT>      //    char[] right = "XEFIWLPGOHSRCVATNYDJBMQKUZ".toCharArray();<a name="line.227"></a>
<FONT color="green">228</FONT>      //    //<a name="line.228"></a>
<FONT color="green">229</FONT>      //    //    // roll the alphabets back to position 1<a name="line.229"></a>
<FONT color="green">230</FONT>      //    //    rollBack(left, right, ct, pt, 260);<a name="line.230"></a>
<FONT color="green">231</FONT>      //    //    System.out.println(left); //  VEYKGTMHISAUXCPODWFQBZJLRN<a name="line.231"></a>
<FONT color="green">232</FONT>      //    //    System.out.println(right); // CXHJMYWKVBRUPNSQFGTIOLDZAE<a name="line.232"></a>
<FONT color="green">233</FONT>      //<a name="line.233"></a>
<FONT color="green">234</FONT>      //    //           Z            N<a name="line.234"></a>
<FONT color="green">235</FONT>      //    //    String lt = "VCEYKGTMHISAUXPODWFQBZJLRN";<a name="line.235"></a>
<FONT color="green">236</FONT>      //    //    String rt = "ECXNHJMYWKVBRUPSQFGTIOLDZA";<a name="line.236"></a>
<FONT color="green">237</FONT>      //    //    <a name="line.237"></a>
<FONT color="green">238</FONT>      //    //    Chaocipher chaocipher = new Chaocipher(lt, rt);<a name="line.238"></a>
<FONT color="green">239</FONT>      //    //    String ciphertext = chaocipher.encipher(new String(pt));<a name="line.239"></a>
<FONT color="green">240</FONT>      //    //    System.out.println(ciphertext);<a name="line.240"></a>
<FONT color="green">241</FONT>      //    //    String plaintext = chaocipher.decipher(new String(ct));<a name="line.241"></a>
<FONT color="green">242</FONT>      //    //    System.out.println(plaintext);<a name="line.242"></a>
<FONT color="green">243</FONT>      //<a name="line.243"></a>
<FONT color="green">244</FONT>      //    // roll the alphabets all the way back to position 1 of the entire text<a name="line.244"></a>
<FONT color="green">245</FONT>      //    String ct = read("test-data/chaocipher-exhibit-1.cracked.ct.txt");<a name="line.245"></a>
<FONT color="green">246</FONT>      //    String pt = read("test-data/chaocipher-exhibit-1.cracked.pt.txt");<a name="line.246"></a>
<FONT color="green">247</FONT>      //    rollBack(left, right, ct.toCharArray(), pt.toCharArray(), 5761);<a name="line.247"></a>
<FONT color="green">248</FONT>      //    System.out.println(left); //  CEDQRSTIXYLMOPZABFVGUHWJKN<a name="line.248"></a>
<FONT color="green">249</FONT>      //    System.out.println(right); // YZBQDSEFGHLWINKCMOPRTUVJXA<a name="line.249"></a>
<FONT color="green">250</FONT>      //<a name="line.250"></a>
<FONT color="green">251</FONT>      //    //           Z            N<a name="line.251"></a>
<FONT color="green">252</FONT>      //    String lt = "CPEDQRSTIXYLMOZABFVGUHWJKN"; // CPEDQRSTIXYLMOZABFVGUHWJKN<a name="line.252"></a>
<FONT color="green">253</FONT>      //    String rt = "AYZNBQDSEFGHLWIKCMOPRTUVJX"; // AYZNBQDSEFGHLWIKCMOPRTUVJX<a name="line.253"></a>
<FONT color="green">254</FONT>      //<a name="line.254"></a>
<FONT color="green">255</FONT>      //    // CLY<a name="line.255"></a>
<FONT color="green">256</FONT>      //    // ALL<a name="line.256"></a>
<FONT color="green">257</FONT>      //  }<a name="line.257"></a>
<FONT color="green">258</FONT>    }<a name="line.258"></a>




























































</PRE>
</BODY>
</HTML>
